Using Cloud Computing for Solving Constraint Programming Problems
نویسندگان
چکیده
We propose to use cloud computing for solving constraint programing problems in parallel. We used the Embarrassingly Parallel Search (EPS) method in conjunction with Microsoft Azure, the cloud computing platform and infrastructure, created by Microsoft. EPS decomposes the problem in many distinct subproblems which are then solved independently by workers. EPS has three advantages: it is an efficient method, it is simple to deploy and it involves almost no communication between workers. Thus, EPS is particularly well-suited method for being used on cloud infrastructure. Experimental results show ratio of gain equivalent to those obtained for a parallel machine or a data center showing the strength of EPS while using in conjunction with a cloud infrastructure. We also compute the number of cores in a cloud infrastructure requires to improve the resolution by a factor of k and we discuss about the price to pay for solving a given problem in a certain amount of time.
منابع مشابه
Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملSolving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
متن کاملCloud Computing Technology Algorithms Capabilities in Managing and Processing Big Data in Business Organizations: MapReduce, Hadoop, Parallel Programming
The objective of this study is to verify the importance of the capabilities of cloud computing services in managing and analyzing big data in business organizations because the rapid development in the use of information technology in general and network technology in particular, has led to the trend of many organizations to make their applications available for use via electronic platforms hos...
متن کامل